Solving Non-Homogeneous Nested Recursions Using Trees
نویسندگان
چکیده
منابع مشابه
A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملSolving factored MDPs using non-homogeneous partitions
We present an algorithm for aggregating states in solving large MDPs (represented as factored MDPs) using search by successive re nement in the space of nonhomogeneous partitions. Homogeneity is de ned in terms of stochastic bisimulation and reward equivalence within blocks of a partition. Since homogeneous partitions that de ne equivalent reduced-state-space MDPs can have a large number of blo...
متن کاملSolving nonlinear recursions
A general method to map a polynomial recursion on a matrix linear one is suggested. The solution of the recursion is represented as a product of a matrix multiplied by the vector of initial values. This matrix is product of transfer matrices whose elements depend only on the polynomial and not on the initial conditions. The method is valid for systems of polynomial recursions and for polynomial...
متن کاملNested Recursions with Ceiling Function Solutions
Unless otherwise noted, we consider only n > 0. The parameters in (1.1) are all integers satisfying k, pi and aij > 0. Assume c initial conditions R(1) = ξ1, R(2) = ξ2, . . . , R(c) = ξc, with all ξi > 0. Golomb [6] first solved the simplest example of such a non-homogeneous nested recursion, namely, G(n) = G(n− G(n− 1)) + 1, G(1) = 1; see also [7]. In fact, all of the recursions we find with c...
متن کاملSums of Ceiling Functions Solve Nested Recursions
It is known that, for given integers s ≥ 0 and j > 0, the nested recursion R(n) = R(n−s−R(n− j))+R(n−2j−s−R(n−3j)) has a closed form solution for which a combinatorial interpretation exists in terms of an infinite, labeled tree. For s = 0, we show that this solution sequence has a closed form as the sum of ceiling functions C(n) = ∑j−1 i=0 ⌈
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2013
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-013-0202-9